Towards high-quality, untangled meshes via a force-directed graph embedding approach

نویسندگان

  • Sanjukta Bhowmick
  • Suzanne M. Shontz
چکیده

High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution, and the stability and conditioning of the stiffness matrix depend upon the mesh quality. In addition, the mesh must be untangled in order for the finite element method to generate physically valid solutions. Tangled meshes, i.e., those with inverted mesh elements, are sometimes generated via large mesh deformations or in the mesh generation process. Traditional techniques for untangling such meshes are based on geometry and/or optimization. Optimization-based mesh untangling techniques first untangle the mesh and then smoothe the resulting untangled mesh in order to obtain high quality meshes; such techniques require the solution of two optimization problems. In this paper, we study how to modify a physical, force-directed method based upon the Fruchterman-Reingold (FR) graph layout algorithm so that it can be used for untangling. The objectives of aesthetic graph layout, such as minimization of edge intersections and near equalization of edge lengths, follow the goals of mesh untangling and generating good quality elements, respectively. Therefore, by using the force-directed method, we can achieve both steps of mesh untangling and mesh smoothing in one operation. We compare the effectiveness of our method with that of the optimization-based mesh untangling method in [1] and implemented in Mesquite by untangling a suite of unstructured triangular, quadrilateral, and tetrahedral finite element volume meshes. The results show that the force-directed method is substantially faster than the Mesquite mesh untangling method without sacrificing much in terms of mesh quality for the majority of the test cases we consider in this paper. The force-directed mesh untangling method demonstrates the most promise on convex geometric domains. Further modifications will be made to the method to improve its ability to untangle meshes on non-convex domains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

متن کامل

GLUG: GPU Layout of Undirected Graphs

We present a fast parallel algorithm for layout of undirected graphs, using commodity graphics processing unit (GPU) hardware. The GLUG algorithm creates a force-based layout minimizing the Kamada Kawai energy of the graph embedding. Two parameters control the graph layout: the number of landmarks used in the force simulation determines the influence of the global structure, while the number of...

متن کامل

A Sparse Stress Model

Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding b...

متن کامل

Efficient, High-Quality Force-Directed Graph Drawing

We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates shortand long-range force efficiently. Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph draw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010